Dependence Graph and Signal Flow Graph Scheduling ofPipelined

In this report, we illustrate the lookahead transformation in both the dependence graph and the signal ow graph domains. Various scheduling approaches for ne-grain pipelined adaptive QR algorithm are proposed, including pipelining, block processing, and incremental block processing. Among them, the incremental block processing ooers the least amount of hardware complexity which is linear increasing with respect to the lookahead step size M with linear factor 2M ? 1. Comparisons between algorithm transformations in the dependence graph domain and ones in the signal ow graph domain are also addressed in this report.